Perfect quantum state transfer on the Johnson scheme
نویسندگان
چکیده
منابع مشابه
On the Nonexistence of Perfect Codes in the Johnson Scheme
Although it was conjectured by Delsarte in 1973 that no nontrivial perfect codes exist in the Johnson scheme, only very partial results are known. In this paper we considerably reduce the range in which perfect codes in the Johnson scheme can exist; e.g., we show that there are no nontrivial perfect codes in the Johnson graph J(2w qp, w), p prime. We give theorems about the structure of perfect...
متن کاملPerfect state transfer in quantum spin networks.
We propose a class of qubit networks that admit the perfect state transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2log3N is the maximal perfect communication dist...
متن کاملPerfect Coding for Dephased Quantum State Transfer
Near-future realisations of quantum technologies, from simple state-generation tasks [1–3] to analogue quantum simulation [4], will be small scale and will rely on intrinsic properties of the system to facilitate as much of their functionality as possible, rather than trying to impose error-prone operations to strong-arm the system into performing tasks. For example, existing quantum simulators...
متن کاملPerfect quantum state transfer with spinor bosons on weighted graphs.
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in polynomial time, even as the number of nodes increases exponentially. The one-dimensional "quantum wire" and the hypercube are special cases in this construction, ...
متن کاملPerfect state transfer in quantum walks on graphs
We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of scalable architectures. Transfer through structures that do not require locally varying dynamic control simplifies the design and hence reduces the opportunities for errors to arise. Continuous time w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2020
ISSN: 0024-3795
DOI: 10.1016/j.laa.2019.09.021